Minimally k-Edge-Connected Directed Graphs of Maximal Size
نویسندگان
چکیده
منابع مشابه
Minimally k-Edge-Connected Directed Graphs of Maximal Size
Let D = (V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V | ≥ f(k) implies |E| ≤ 2k(|V | − k). We also determine the extremal graphs whose size attains this upper bound.
متن کاملMinimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملThe characterization of edge-maximal critically k-edge connected graphs
Let G be a simple graph on n vertices having edge-connectivity 1(' (G) > O. We say G is k-critical if 1(' (G) :::: k and 1(1 (G-e) < k for every edge e of G. We denote by ~(n,k) the set of all k-critical graphs on n vertices. In this paper we prove that the maximum number of edges of a graph G in ~(n,k) to be: k(n-k) if n ~ 3k; and L ~ (n+k)2 J. if k + 1 s n < 3k. Further, we characterise the e...
متن کاملOn minimally rainbow k-connected graphs
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. A graph G is called rainbow k-connected, if there is an edge-colouring of G with k colours such that G is rainbow-connected. In this talk we will study rainbow k-connected graphs with a minimum number of edges. For an integer n ≥ 3 and 1 ≤ k ≤ n − 1 let t(n, k) denote the...
متن کاملContractible edges in minimally k-connected graphs
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K1 + C4)-free minimally k-connected graph has a k-contractible edge, if incident to each vertex of degree k, there is an edge which is not contained in a triangle. This implies two previous results, one due to Thomassen and the other due to K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2005
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-004-0588-6